منابع مشابه
Afriat from MaxMin
Afriat’s original method of proof is restored by using the minmax theorem.
متن کاملTeam-Maxmin Equilibria
In a noncooperative game, a team is a set of players that have identical payoffs. We investigate zero-sum games where a team of several players plays against a single adversary. The team is not regarded as a single player because the team members might not be able to coordinate their actions. In such a game, a certain equilibrium can be selected naturally: the team-maxmin equilibrium. It assure...
متن کاملAspiration, Sympathy and Maxmin Outcome
This paper rigorously examines a dynamic behavioral foundation of the Rawlsian criterion, that selects a social outcome which maximizes the payoff of the worst off agent. In order to understand how the behavior of individual agents shapes up this social norm through repeated long term interactions among agents, we analyze a dynamic matching process in which a long term relationship is embedded....
متن کاملPurely subjective Maxmin Expected Utility
The Maxmin Expected Utility decision rule suggests that the decision maker can be characterized by a utility function and a set of prior probabilities, such that the chosen act maximizes the minimal expected utility, where the minimum is taken over the priors in the set. Gilboa and Schmeidler axiomatized the maxmin decision rule in an environment where acts map states of nature into simple lott...
متن کاملThe Complexity of MaxMin Length Triangulation
In 1991, Edelsbrunner and Tan gave an O(n) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NPcomplete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 2005
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556780512331318263